Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
نویسندگان
چکیده
منابع مشابه
Solving the Frequency Assignment Problem by Site Availability and Constraint Programming
The efficient use of bandwidth for radio communications becomes more and more crucial when developing new information technologies and their applications. The core issues are addressed by the so-called Frequency Assignment Problems (FAP). Our work investigates static FAP, where an attempt is first made to configure a kernel of links. We study the problem based on the concepts and techniques of ...
متن کاملSolving Frequency Assignment Problems with Constraint Programming
The topic of this diploma thesis is the solving of a Frequency Assignment Problem (FAP) in GSM radio networks by means of Constraint Programming. The task of frequency planning is the assignment of frequencies to base stations w.r.t. various constraints such that interference, which may have a substantial impact on the quality of the received signals, is avoided as far as possible. Constraint P...
متن کاملSolving the Dynamic Frequency Assignment Problem
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. For all these situations, a frequency assignment problem arises with application of specific characteristics. Different modelling ideas for every problem features, have been developed such as the handling of interference among radio s...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولPreference-based Problem Solving for Constraint Programming
Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization approaches compile those preferences into a single utility function and use it as the optimization objective when solving the problem, but neither explain why the resulting solution satisfies the original preferences, nor indica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de Tecnologia da Informação e Comunicação
سال: 2012
ISSN: 2237-5112
DOI: 10.12721/2237-5112.v01n02a06